Publications CIKM 2016
نویسندگان
چکیده
Publications: CIKM 2016 Justin Sampson, Fred Morstatter, Liang Wu and Huan Liu. "Leveraging the Implicit Structure within Social Media for Emergent Rumor Detection", short paper. Suhang Wang , Jiliang Tang, Fred Morstatter and Huan Liu. "Paired Restricted Boltzmann Machine for Linked Data. Suhang Wang , Jiliang Tang, Charu Aggarwal and Huan Liu. "Linked Document Embedding for Classification. Kewei Cheng, Jundong Li and Huan Liu. "FeatureMiner: A Tool for Interactive Feature Selection", demo paper.
منابع مشابه
Cross Device Matching for Online Advertising with Neural Feature Ensembles : First Place Solution at CIKM Cup 2016
We describe the 1st place winning approach for the CIKM Cup 2016 Challenge. In this paper, we provide an approach to reasonably identify same users across multiple devices based on browsing logs. Our approach regards a candidate ranking problem as pairwise classification and utilizes an unsupervised neural feature ensemble approach to learn latent features of users. Combined with traditional ha...
متن کاملCross-Device User Matching Based on Massive Browse Logs: The Runner-Up Solution for the 2016 CIKM Cup
As the number and variety of smart devices increase, users may use myriad devices in their daily lives and the online activities become highly fragmented. Building an accurate user identity becomes a difficult and important problem for advertising companies. The task for the CIKM Cup 2016 Track 1 was to find the same user cross multiple devices. This paper discusses our solution to the challeng...
متن کاملClassification and Learning-to-rank Approaches for Cross-Device Matching at CIKM Cup 2016
In this paper, we propose two methods for tackling the problem of cross-device matching for online advertising at CIKM Cup 2016. The first method considers the matching problem as a binary classification task and solve it by utilizing ensemble learning techniques. The second method defines the matching problem as a ranking task and effectively solve it with using learning-to-rank algorithms. Th...
متن کاملFormalization of the prime number theorem and Dirichlet's theorem
We present the formalization of Dirichlet’s theorem on the infinitude of primes in arithmetic progressions, and Selberg’s elementary proof of the prime number theorem, which asserts that the number π(x) of primes less than x is asymptotic to x/ log x, within the proof system Metamath.
متن کاملswMATH - Challenges, Next Steps, and Outlook
swMATH [?] is currently one of the most comprehensive specialized information services and search engines for Mathematical SoftWare (MSW). It was the intention of the project to support the user community by providing information about MSW and searching relevant MSW. Currently swMATH lists information of more than 13,000 items and 120,000 publications which refer to MSW. Maintaining and updatin...
متن کامل